Performance Evaluation : = (Process Algebra + Model Checking) × Markov Chains

نویسندگان

  • Holger Hermanns
  • Joost-Pieter Katoen
چکیده

Markov chains are widely used in practice to determine system performance and reliability characteristics. The vast majority of applications considers continuous-time Markov chains (CTMCs). This tutorial paper shows how successful model specification and analysis techniques from concurrency theory can be applied to performance evaluation. The specification of CTMCs is supported by a stochastic process algebra, while the quantitative analysis of these models is tackled by means of model checking. Process algebra provides: (i) a high-level specification formalism for describing CTMCs in a precise, modular and constraint-oriented way, and (ii) means for the automated generation and aggregation of CTMCs. Temporal logic model checking provides: (i) a formalism to specify complex measures-of-interest in a lucid, compact and flexible way, (ii) automated means to quantify these measures over CTMCs, and (iii) automated measure-driven aggregation (lumping) of CTMCs. Combining process algebra and model checking constitutes a coherent framework for performance evaluation based on CTMCs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Model Checker for Performance and Dependability Properties

Markov chains are widely used in the context of performance and reliability evaluation of systems of various nature. Model checking of such chains with respect to a given (branching) temporal logic formula has been proposed for both the discrete [8] and the continuous time setting [1], [3]. In this short paper, we describe the prototype model checker E T MC for discrete and continuous-time Mark...

متن کامل

PRISM: Probabilistic Symbolic Model Checker

In this paper we describe PRISM, a tool being developed at the University of Birmingham for the analysis of probabilistic systems. PRISM supports three probabilistic models: discrete-time Markov chains, continuous-time Markov chains and Markov decision processes. Analysis is performed through model checking such systems against specifications written in the probabilistic temporal logics PCTL an...

متن کامل

Model Checking Timed and Stochastic Properties with CSL

Markov chains are a well-known stochastic process that provide a balance between being able to adequately model the system’s behavior and being able to afford the cost of the model solution. Systems can be modeled directly as Markov chains, or with a higher-level formalism for which Markov chains represent the underlying semantics. Markov chains are widely used to study the performance of compu...

متن کامل

ETMCC: Model Checking Performability Properties of Markov Chains

Model Checking Markov Chains Markov chains are widely used for modelling the behaviour of computer and communication systems. A common goal of modelling is the estimation of performance and dependability measures of the system under study, such as throughput, buffer occupancy or mean time to failure. With model checking, the angle is somewhat different: Instead of conducting an analysis whose a...

متن کامل

Stochastic Comparison approach for Stochastic Model Checking

Stochastic model checking requires the computation of steady-state or transient distribution for finite or infinite Markov chains for the evaluation of some formulas implying probabilities. However the numerical analysis of Markov chains is much less efficient than the sophisticated algorithmic techniques such as MTBDD developed for the deterministic model checking. We propose to simplify the n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001